Programming Multigrid Methods with B-Splines
نویسندگان
چکیده
Multigrid algorithms are the method of choice for solving large Ritz-Galerkin systems for elliptic boundary value problems. Using b-spline bases provides geometric flexibility as well as many computational advantages and permits particularly efficient and elegant implementations. This is described for a fairly general discretization which covers all principal features of b-spline elements.
منابع مشابه
Multigrid methods with Powell-Sabin splines
We present a multigrid algorithm for the solution of the linear systems that arise from a finite element discretization of second order elliptic partial differential equations with Powell-Sabin splines. We show that the method yields a uniform convergence independent of the mesh size.
متن کاملGENETIC PROGRAMMING AND MULTIVARIATE ADAPTIVE REGRESION SPLINES FOR PRIDICTION OF BRIDGE RISKS AND COMPARISION OF PERFORMANCES
In this paper, two different data driven models, genetic programming (GP) and multivariate adoptive regression splines (MARS), have been adopted to create the models for prediction of bridge risk score. Input parameters of bridge risks consists of safe risk rating (SRR), functional risk rating (FRR), sustainability risk rating (SUR), environmental risk rating (ERR) and target output. The total ...
متن کاملA Robust Multigrid Method for Isogeometric Analysis using Boundary Correction
The fast solution of linear systems arising from an isogeometric discretization of a partial differential equation is of great importance for the practical use of Isogeometric Analysis. For classical finite element discretizations, multigrid methods are well known to be fast solvers showing optimal convergence behavior. However, if a geometric multigrid solver is naively applied to a linear sys...
متن کاملJOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics A Robust Multigrid Method for Isogeometric Analysis using Boundary Correction
The fast solution of linear systems arising from an isogeometric discretization of a partial differential equation is of great importance for the practical use of Isogeometric Analysis. For classical finite element discretizations, multigrid methods are well known to be fast solvers showing optimal convergence behavior. However, if a geometric multigrid solver is naively applied to a linear sys...
متن کاملB-Spline-Based Monotone Multigrid Methods
Abstract. For the efficient numerical solution of elliptic variational inequalities on closed convex sets, multigrid methods based on piecewise linear finite elements have been investigated over the past decades. Essential for their success is the appropriate approximation of the constraint set on coarser grids which is based on function values for piecewise linear finite elements. On the other...
متن کامل